Temporal Probabilistic Logic Programs
نویسندگان
چکیده
There are many applications where the precise time at which an event will occur (or has occurred) is uncertain. Temporal probabilistic logic programs (TPLPs) allow a programmer to express knowledge about such events. In this paper, we develop a model theory, xpoint theory, and proof theory for TPLPs, and show that the xpoint theory may be used to enumerate consequences of a TPLP in a sound and complete manner. Likewise the proof theory provides a sound and complete inference system. Last, but not least, we provide complexity results for TPLPs, showing in particular, that reasonable classes of TPLPs have polynomial data complexity.
منابع مشابه
Temporal Probabilistic Logic Programs: State and Revision
There are numerous applications where we have to deal with temporal uncertainty associated with events. The Temporal Probabilistic (TP) Logic Programs should provide support for valid-time indeterminacy of events, by proposing the concept of an indeterminate instant, that is, an interval of time-points (event’s time-window) with an associated, lower and upper, probability distribution. In parti...
متن کاملAbduction in Annotated Probabilistic Temporal Logic
Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true K time units after formula F became true with L to U% probability.” In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Π, a set of formulas H that c...
متن کاملProbabilistic Propositional Temporal Logics
We present two (closely-related) propositional probabilistic temporal logics based on temporal logics of branching time as introduced The first logic, PTLf, is interpreted over finite models, while the second logic, PTLb, which is an extension of the first one, is interpreted over infinite models with transition probabilities bounded away from O. The logic PTLf allows us to reason about finite-...
متن کاملReasoning with Probabilities , Time And
Over the years probability theory has emerged as the leading way of dealing with uncertainty in AI and Databases. However, application of probabilistic methods to diierent frameworks has always been a problem as the two main goals of such an application | eeciency and correctness | are often at odds with each other. This is so because diierent dependencies between the events considered cause di...
متن کاملModel checking with probabilistic tabled logic programming
We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999